Playing Pushdown Parity Games in a Hurry
نویسندگان
چکیده
منابع مشابه
Playing Pushdown Parity Games in a Hurry
Introduction. Infinite two-player games on graphs are a powerful tool to model, verify, and synthesize open reactive systems and are closely related to fixed-point logics. The winner of a play in such a game typically emerges only after completing the whole (infinite) play. Despite this, McNaughton became interested in playing infinite games in finite time, motivated by his belief that “infinit...
متن کاملPlaying Pushdown Parity Games in a Hurry ( Extended Abstract )
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.
متن کاملPlaying Muller Games in a Hurry
This work considers a finite-duration variant of Muller games, and their connection to infinite-duration Muller games. In particular, it studies the question of how long a finiteduration Muller game must be played before the winner of the finite-duration game is guaranteed to be able to win the corresponding infinite-duration game. Previous work by McNaughton has shown that this must occur afte...
متن کاملWinning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the parity condition. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton transformations to compute ...
متن کاملPlaying Parity Games on the Playstation 3
The Small Progress Measures parity game algorithm, developed by Marcin Jurdziński, is perfectly suitable for parallel execution. The current parallel algorithm is programmed for the x86 computer architecture. In this paper, a clustering approach is introduced, as well as a variation on the Small Progress Measures algorithm, to enable execution on the IBM Cell Broadband Architecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.96.14